On Flat Polyhedra deriving from Alexandrov's Theorem

نویسنده

  • Joseph O'Rourke
چکیده

We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov’s gluing theorem is a degenerate flat polyhedron, and to reconstruct it from the gluing instructions. The algorithm runs in O(n) time for polygons whose gluings are specified by n labels.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Infinitesimally Rigid Polyhedra. I. Statics of Frameworks

From the time of Cauchy, mathematicians have studied the motions of convex polyhedra, with the faces held rigid while changes are allowed in the dihedral angles. In the 1940s Alexandrov proved that, even with additional vertices along the natural edges, and with an arbitrary triangulation of the natural faces on these vertices, such polyhedra are infinitesimally rigid. In this paper the dual (a...

متن کامل

A Variational Principle for Weighted Delaunay Triangulations and Hyperideal Polyhedra

We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted Delaunay triangulations may be interpreted as images of hyperbolic polyhedra with one vertex on and the remaining vertices beyond the infinite boundary of hype...

متن کامل

A Variational Proof of Alexandrov's Convex Cap Theorem

We give a variational proof of the existence and uniqueness of a convex cap with the given upper boundary. The proof uses the concavity of the total scalar curvature functional on the space of generalized convex caps. As a byproduct, we prove that generalized convex caps with the fixed boundary are globally rigid, that is uniquely determined by their curvatures.

متن کامل

On (po-)torsion free and principally weakly (po-)flat $S$-posets

In this paper, we first consider (po-)torsion free and principally weakly (po-)flat $S$-posets, specifically  we discuss when (po-)torsion freeness implies principal weak (po-)flatness. Furthermore, we give a counterexample to show that Theorem 3.22 of Shi is incorrect. Thereby we present a correct version of this theorem. Finally, we characterize pomonoids over which all cyclic $S$-posets are ...

متن کامل

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1007.2016  شماره 

صفحات  -

تاریخ انتشار 2010